Compiler and Runtime Supports for High-Performance, Scalable Big Data Systems

نویسنده

  • Khanh Nguyen
چکیده

Big Data analytics applications such as social network analysis and web analysis have revolutionized modern computing. The processing demand posed by an unprecedented amount of data challenges both industrial practitioners and academia researchers to design and implement highly efficient and scalable system infrastructures. Unfortunately, Big Data processing is fundamentally limited by memory inefficiencies inherent with the underlying programming languages. While offering several invaluable benefits, a managed runtime comes with time and space overheads. In large-scale systems, the memory management cost can be easily magnified and become the critical performance bottleneck. Throughout my Ph.D., I have designed and developed a series of system optimizations to enable scalable Big Data processing including a new programming model, and several novel compiler and runtime supports. In my remaining time at UC Irvine, I plan to continue addressing the low-performance issue in data-intensive systems by developing practical solutions across the whole software stack, spanning from the processing model to language extensions.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Compiler and Runtime Supports for Efficient and Scalable Big Data Systems

Big Data analytics applications such as social network analysis and web analysis have revolutionized modern computing. The processing demand posed by an unprecedented amount of data challenges both industrial practitioners and academia researchers to design and implement highly efficient and scalable system infrastructures. Unfortunately, Big Data processing is fundamentally limited by memory i...

متن کامل

Automatic Code Generation for an Asynchronous Task-based Runtime

Hardware scaling considerations associated with the quest for exascale and extreme scale computing are driving system designers to consider event-driven-task (EDT)-oriented execution models for executing on deep hardware hierarchies. Further, for performance, productivity, and code sustainability reasons, there is an increasing demand for autoparallelizing compiler technologies to automatically...

متن کامل

Hierarchical Place Trees: A Portable Abstraction for Task Parallelism and Data Movement

Modern computer systems feature multiple homogeneous or heterogeneous computing units with deep memory hierarchies, and expect a high degree of thread-level parallelism from the software. Exploitation of data locality is critical to achieving scalable parallelism, but adds a significant dimension of complexity to performance optimization of parallel programs. This is especially true for program...

متن کامل

Implementing a Parallel C + + Runtime System forScalable Parallel Systems 1

pC++ is a language extension to C++ designed to allow programmers to compose \concurrent aggregate" collection classes which can be aligned and distributed over the memory hierarchy of a parallel machine in a manner modeled on the High Performance Fortran Forum (HPFF) directives for Fortran 90. pC++ allows the user to write portable and eecient code which will run on a wide range of scalable pa...

متن کامل

Dynamic Grain-Size Adaptation on Object Oriented Parallel Programming The SCOOPP Approach

This paper presents the SCOOPP (SCalable Object Oriented Parallel Programming) approach to support the design and execution of scalable parallel applications. The SCOOPP programming model aims the portability, dynamic scalability and efficiency of parallel applications. The SCOOPP is an hybrid compile and run-time system, which can perform parallelism extraction, supports explicit parallelism a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016